منابع مشابه
Towards Automating Grammar Equivalence Checking
We consider from practical perspective the (generally undecidable) problem of checking equivalence of context-free grammars. We present both techniques for proving equivalence, as well as techniques for finding counter-examples that establish non-equivalence. Among the key building blocks of our approach is a novel algorithm for efficiently enumerating and sampling words and parse trees from ar...
متن کاملArboretum: Using a precision grammar for grammar checking in CALL
We present a tutorial system for language learners, using a computational grammar augmented with mal-rules for analysis, error diagnosis, and semantics-centered generation of corrected forms. Corrections are produced using a novel strategy of
متن کاملGrammar checking for Swedish second language learners
Grammar errors and context-sensitive spelling errors in texts written by second language learners are hard to detect automatically. We have used three different approaches for grammar checking: manually constructed error detection rules, statistical differences between correct and incorrect texts, and machine learning of specific error types. The three approaches have been evaluated using a cor...
متن کاملA Grammar Checking System for Punjabi
This article provides description about the grammar checking system developed for detecting various grammatical errors in Punjabi texts. This system utilizes a fullform lexicon for morphological analysis, and applies rule-based approaches for part-of-speech tagging and phrase chunking. The system follows a novel approach of performing agreement checks at phrase and clause levels using the gramm...
متن کاملPositive Grammar Checking: A Finite State Approach
This paper reports on the development of a finite state system for finding grammar errors without actually specifying the error. A corpus of Swedish text written by children served as the data. Errors are more frequent and the distribution of the error types is different than for adult writers. Our approach (following Karttunen et al. [9]) for finding errors involves developing automata that re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Natural Language Engineering
سال: 2016
ISSN: 1351-3249,1469-8110
DOI: 10.1017/s1351324916000061